A On approximate decidability of minimal programs
نویسندگان
چکیده
An index e in a numbering of partial-recursive functions is called minimal if every lesser index computes a different function from e. Since the 1960’s it has been known that, in any reasonable programming language, no effective procedure determines whether or not a given index is minimal. We investigate whether the task of determining minimal indices can be solved in an approximate sense. Our first question, regarding the set of minimal indices, is whether there exists an algorithm which can correctly label 1 out of k indices as either minimal or non-minimal. Our second question, regarding the function which computes minimal indices, is whether one can compute a short list of candidate indices which includes a minimal index for a given program. We give negative answers to both questions for the important case of numberings with linearly bounded translators.
منابع مشابه
Preprint-reihe Mathematik Ernst-moritz-arndt-universit at Greifswald Approximate Decidability in Euclidean Spaces { Draft { Approximate Decidability in Euclidean Spaces { Draft {
We study concepts of decidability (recursivity) for subsets of Euclidean spaces R k within the framework of approximate computability (type two theory of ef-fectivity). A new notion of approximate decidability is proposed and discussed in some detail. It is an eeective variant of F. Hausdorr's concept of resolvable sets and modiies and generalizes notions of recursivity known from computable an...
متن کاملO-Minimal Invariants for Linear Loops
The termination analysis of linear loops plays a key rôle in several areas of computer science, including program verification and abstract interpretation. Such deceptively simple questions also relate to a number of deep open problems, such as the decidability of the Skolem and Positivity Problems for linear recurrence sequences, or equivalently reachability questions for discrete-time linear ...
متن کاملDecidability of the Clark's completion semantics for monadic programs and queries
There are many different semantics for general logic programs (i.e. programs that use negation in the bodies of clauses). Most of these semantics are Turing complete (in a sense that can be made precise), implying that they are undecidable. To obtain decidability one needs to put additional restrictions on programs and queries. In logic programming it is natural to put restrictions on the under...
متن کاملDecidability of All Minimal Models (Revised Version - 2012)
This unpublished note is an alternate, shorter (and hopefully more readable) proof of the decidability of all minimal models. The decidability follows a proof of the existence of a cellular term in each observational equivalence class of a minimal model. The first proof I gave of the decidability of all minimal models [3] was far from being easy to understand. I was only an inexperienced studen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015